منابع مشابه
Strongly Normalizing Audited Computation
Auditing is an increasingly important operation for computer programming, for example in security (e.g. to enable history-based access control) and to enable reproducibility and accountability (e.g. provenance in scientific programming). Most proposed auditing techniques are ad hoc or treat auditing as a second-class, extralinguistic operation; logical or semantic foundations for auditing are n...
متن کاملExtensions of strongly alpha-reversible rings
We introduce the notion ofstrongly $alpha$-reversible rings which is a strong version of$alpha$-reversible rings, and investigate its properties. We firstgive an example to show that strongly reversible rings need not bestrongly $alpha$-reversible. We next argue about the strong$alpha$-reversibility of some kinds of extensions. A number ofproperties of this version are established. It is shown ...
متن کاملextensions of strongly alpha-reversible rings
we introduce the notion ofstrongly $alpha$-reversible rings which is a strong version of$alpha$-reversible rings, and investigate its properties. we firstgive an example to show that strongly reversible rings need not bestrongly $alpha$-reversible. we next argue about the strong$alpha$-reversibility of some kinds of extensions. a number ofproperties of this version are established. it is shown ...
متن کاملDeriving a Strongly Normalizing STG Machine
We present a modified version of the spineless tagless graph machine (or STG machine for short), that can deal with free variables and makes it possible to use compiled code for the normalization of functional expressions. We derive the machine from a high level semantics, thus enabling a simple correctness proof. Our modified STG machine has been successfully implemented in the Ulysses system.
متن کاملMendler-style Iso-(Co)inductive predicates: a strongly normalizing approach
We present an extension of the second-order logic AF2 with iso-style inductive and coinductive definitions specifically designed to extract programs from proofs à la Krivine-Parigot by means of primitive (co)recursion principles. Our logic includes primitive constructors of least and greatest fixed points of predicate transformers, but contrary to the common approach, we do not restrict ourselv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 1994
ISSN: 0022-4049
DOI: 10.1016/0022-4049(94)90021-3